Convex Relaxations of the Short-Term Hydrothermal Scheduling Problem

This paper concerns the assessment of two methods for convex relaxation short-term hydrothermal scheduling problem. The problem is originally formulated as a mixed integer programming problem, and then approximated using both Lagrangian Linear relaxation. are quantitatively compared realistic data description Northern European power system, considering set representative days. We find that approximates system operational costs in range 55-81% closer to solution than show how these cost gaps vary with season climatic conditions. Conversely, differences marginal electricity reserve capacity provided by muted.